Chaotic versus Classical Stream Ciphers – a Comparative Study
نویسندگان
چکیده
Chaotic and classical (binary) stream ciphers are compared with respect to their cryptographical properties. Possible synchronization schemes, algebraic and analytical properties as well as design and implementation aspects are discussed. For two example classes with similar system structures it is shown that chaotic stream ciphers can achieve a higher level of complexity than classical binary systems due to the algebraic properties of the system structure.
منابع مشابه
Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography
Chaotic cryptology is widely investigated recently. This paper reviews the progress in this area and points out some existent problems in digital chaotic ciphers. As a comprehensive solution to these problems, a novel pseudo-random bit generator based on a couple of chaotic systems called CCS-PRBG is presented. Detailed theoretical analyses show that it has perfect cryptographic properties, and...
متن کاملStream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملNon-Linearity and Security of Self Synchronizing Stream Ciphers
Several proposed chaos based ciphers exploit the ergodic property of chaotic orbits. As chaotic systems are unstable and have sensitive dependence on initial conditions, the main difficulty for the receiver is to reproduce the chaotic signal that has been generated by the sender in order to correctly decrypt the message. This is performed by a self synchronizing device. In discrete cryptography...
متن کاملTurbo Codes Can Be Asymptotically Information-Theoretically Secure
This paper shows that a turbo-coded communication system can be made secure with a little bit of complexity cost. The classical permutation ciphers are revisited and analyzed. Firstly, the ideal stream permutation ciphers are shown to be asymptotically information-theoretically secure in the sense that the channel from plaintext to ciphertext has a vanished capacity, while the practical stream ...
متن کاملStream Ciphers: A Comparative Study of Attacks and Structures
In the latest past, research work has been done in the region of steam ciphers and as a answer of which, several design models for stream ciphers were projected. In Order to appreciate a international standard for data encryption that would prove good in the due course of time, endure the action of cryptanalysis algorithms and reinforce the security that will take longer to be broken, this rese...
متن کامل